FPGA Technology and Sequential Finite State Machine Method
نویسندگان
چکیده
منابع مشابه
Efficient Sequential ATPG Based on Partitioned Finite-State-Machine Traversal
We present a new automatic test pattern generation algorithm for sequential circuits by traversing the partitioned state spaces. The new features include: (1) nondisjoint state groups are obtained such that two different state groups may have common flip-flops, (2) partial state transition graphs (STGs) are constructed at run time for each state group, (3) spectral information for state variabl...
متن کاملMethod of analysing extended finite-state machine specifications
Formal specifications are the basis for automated verification and implementation in communication software. The paper gives a method of dynamic analysis for modular specifications which is based on symbolic execution and reachability analysis. Symbolic execution is a technique for static analysis and applied first to the specification. It is effective in detecting syntactic and semantic errors...
متن کاملState Assignment for Finite State Machine Synthesis
This paper proposes simulated annealing based algorithm for the synthesis of a finite state machine to determine the optimal state assignment with less area and power dissipation. The algorithm has two annealing stages. In the first rough annealing stage it tries to search in global scope by the proposed rough search method. In the second focusing annealing stage it tries to search in local sco...
متن کاملFinite state machine for mutation
In this paper an attempt has been made to represent biological mutational activities through sequential mathematical machines. Begin with a brief theory of finite state sequential machines genetic sequences are presented in a systematic manner. A mutator has been shown as a variety of finite state machines. The mutation is studied systematically and an automaton have been constructed with the b...
متن کاملTranslatable Finite State Time Machine
The paper describes syntax, behavior and formal semantics of a new class of timed automata, which are tailored for modeling the behavior of real-time systems. A formal method for automatic generation of programs is developed around this model. The method starts from modeling the desired behavior of the system under design by means of a UML-based state machine with the ability to measure time, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hue University Journal of Science: Natural Science
سال: 2018
ISSN: 2615-9678,1859-1388
DOI: 10.26459/hueuni-jns.v127i1d.5073